Path graph

Results: 1083



#Item
161Graph / Matching / Bipartite graph / Independent set / Matroid theory / Tutte polynomial / Path decomposition / Graph theory / Mathematics / NP-complete problems

BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2001-05-28 05:33:34
162Dimension reduction / Multivariate statistics / Graph / Neighbourhood / Elastic map / Connectivity / Linkless embedding / Path decomposition / Graph theory / Mathematics / Topological graph theory

June 3, :International Journal of Neural Systems, Vol. 20, No–232 c World Scientific Publishing Company  DOI: S0129065710002383

Add to Reading List

Source URL: www.ihes.fr

Language: English - Date: 2010-06-18 08:47:36
163NP-complete problems / Vertex cover / Vertex / Graph / Hamiltonian path / Tree / Clique / Neighbourhood / Connectivity / Graph theory / Mathematics / Theoretical computer science

Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal|gsat|neeldhara}@csa.iisc.ernet.in

Add to Reading List

Source URL: drona.csa.iisc.ernet.in

Language: English - Date: 2014-08-01 08:33:48
164Operations research / Convex optimization / Linear programming / Degree / Shortest path problem / Graph / Matching / Mathematics / Graph theory / Theoretical computer science

COMPSCI 530: Design and Analysis of AlgorithmsLecture 22 Lecturer: Debmalya Panigrahi

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2014-09-24 20:01:22
165Network theory / Shortest path problem / Fibonacci heap / Binary logarithm / Mathematics / Graph theory / Theoretical computer science

6.889 — Lecture 4: Single-Source Shortest Paths Christian Sommer September 19 and 26, 2011 Single-Source Shortest Path (SSSP) Problem: given a graph G = (V, E) and a source vertex s ∈ V , compute shortes

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-09-26 10:03:02
166Graph / Graph coloring / Planar separator theorem / Path decomposition / Graph theory / NP-complete problems / Graph partition

KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu

Add to Reading List

Source URL: algo2.iti.kit.edu

Language: English - Date: 2015-01-03 02:07:55
167Outerplanar graph / Tree decomposition / Minor / Graph coloring / Graph / Tree / Path decomposition / Degeneracy / Graph theory / Planar graphs / Graph operations

Vertex Separators and low tree-width k-coloring Lectures 11 and 12, January 12 and 19, A theorem about vertex separators

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2012-01-23 02:46:03
168Spanning tree / Loop-erased random walk / Minimum spanning tree / Chernoff bound / Eulerian path / NP-complete problems / Dominating set / Tutte polynomial / Graph theory / Mathematics / Theoretical computer science

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2009-10-28 12:34:47
169Tree decomposition / Path decomposition / Width / Boolean satisfiability problem / Graph theory / Theoretical computer science / Graph operations

Treewidth in Verification: Local vs. Global⋆ Andrea Ferrara1 , Guoqiang Pan2 , and Moshe Y. Vardi2 1 DIS - Universit`a di Roma ”La Sapienza” Via Salaria 113, 00198 Roma, Italy

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2005-09-30 15:47:37
170Routing algorithms / Search algorithms / Combinatorial optimization / Game artificial intelligence / Network theory / Heuristic function / Routing / A* search algorithm / Shortest path problem / Mathematics / Graph theory / Theoretical computer science

Walk the Line: Consistent Network Updates with Bandwidth Guarantees Soudeh Ghorbani and Matthew Caesar Department of Computer Science University of Illinois at Urbana-Champaign 201 North Goodwin Avenue

Add to Reading List

Source URL: conferences.sigcomm.org

Language: English - Date: 2012-07-17 10:54:46
UPDATE